The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm
نویسندگان
چکیده
منابع مشابه
An Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملa new algorithm and software of individual life insurance and annuity computation
چکیده ندارد.
15 صفحه اولBranch-and-cut Algorithms for Integer Programming, Branch-and-cut
Branch-and-cut methods are exact algorithms for integer programming problems. They consist of a combination of a cutting plane method with a branch-and-bound algorithm. These methods work by solving a sequence of linear programming relaxations of the integer programming problem. Cutting plane methods improve the relaxation of the problem to more closely approximate the integer programming probl...
متن کاملNew formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem Sergio García, Mercedes Landete and Alfredo Marín Septiembre 2011 ISSN 1576-7264 Depósito legal A-646-2000 Abstract This article deals with the uncapacitated multiple allocation phub median problem, where p facilities (hubs) must be located among n available sites in order to minimize the transportat...
متن کاملA Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem
The Capacitated m-ring-star Problem is a variant of the classical one-depot capacitated vehicle routing problem in which a customer is either on a route or is connected to another customer or to some Steiner point present in a route. We develop a new exact algorithm for this problem using a branch-and-cut-and-price approach and compare its performance with that of a branch-and-cut algorithm pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.01.015